Math 301: Matchings in Graphs
نویسنده
چکیده
A matching in a graph G is a set M = {e1, e2, . . . , ek} of edges such that each vertex v ∈ V (G) appears in at most one edge of M . That is, ei ∩ ej = ∅ for all i, j. The size of a matching is the number of edges that appear in the matching. A perfect matching in a graph G is a matching in which every vertex of G appears exactly once, that is, a matching of size exactly n/2. Note that a perfect matching can only occur in a graph with evenly many vertices.
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملA New Lower Bound on the Number of Perfect Matchings in Cubic Graphs
We prove that every n-vertex cubic bridgeless graph has at least n/2 perfect matchings and give a list of all 17 such graphs that have less than n/2 + 2 perfect matchings.
متن کاملCoverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملEnumeration of Matchings in the Incidence Graphs of Complete and Complete Bipartite Graphs
If G = (V,E) is a graph, the incidence graph I(G) is the graph with vertices V ∪ E and an edge joining v ∈ V and e ∈ E when and only when v is incident with e in G. For G equal to Kn (the complete graph on n vertices) or Kn,n (the complete bipartite graph on n+ n vertices), we enumerate the matchings (sets of edges, no two having a vertex in common) in I(G), both exactly (in terms of generating...
متن کاملGraphical condensation of plane graphs: A combinatorial approach
The method of graphical vertex-condensation for enumerating perfect matchings of plane bipartite graph was found by Propp (Theoret. Comput. Sci. 303(2003), 267-301), and was generalized by Kuo (Theoret. Comput. Sci. 319 (2004), 29-57) and Yan and Zhang (J. Combin. Theory Ser. A, 110(2005), 113125). In this paper, by a purely combinatorial method some explicit identities on graphical vertex-cond...
متن کامل